Some Dominating Sets of Lexicographic Product Graphs of Euler Totient Cayley Graphs with Arithmetic Graphs
نویسندگان
چکیده
The theory of domination in graphs is an emerging area of research in graph theory today. It has been studied extensively and finds applications to various branches of Science & Technology.Products are often viewed as a convenient language with which one can describe structures, but they are increasingly being applied in more substantial ways. In this paper, we consider lexicographic product graph of Euler totient Cayley graphs with Arithmetic graphs and present some results on domination parameters of these graphs.
منابع مشابه
Independent Domination Number of Euler Totient Cayley Graphs and Arithmetic Graphs
Nathanson was the pioneer in introducing the concepts of Number Theory, particularly, the “Theory of Congruences” in Graph Theory, thus paved the way for the emergence of a new class of graphs, namely “Arithmetic Graphs”. Cayley graphs are another class of graphs associated with the elements of a group. If this group is associated with some arithmetic function then the Cayley graph becomes an A...
متن کاملSome Properties of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs
Nathanson was the pioneer in introducing the concepts of Number Theory, particularly, the "Theory of Congruences" in Graph Theory, thus paving way for the emergence of a new class of graphs, namely "Arithmetic Graphs". Cayley graphs are another class of graphs associated with the elements of a group. If this group is associated with some arithmetic function then the Cayley g...
متن کاملGraph product of generalized Cayley graphs over polygroups
In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015